Solving Method for Linear Fractional Optimization Problem with Fuzzy Coefficients in the Objective Function

نویسندگان

  • B. Stanojević
  • M. Stanojević
  • Bogdana Stanojević
چکیده

The importance of linear fractional programming comes from the fact that many real life problems are based on the ratio of physical or economic values (for example cost/time, cost/volume, profit/cost or any other quantities that measure the efficiency of a system) expressed by linear functions. Usually, the coefficients used in mathematical models are subject to errors of measurement or vary with market conditions. Dealing with inaccuracy or uncertainty of the input data is made possible by means of the fuzzy set theory. Our purpose is to introduce a method of solving a linear fractional programming problem with uncertain coefficients in the objective function. We have applied recent concepts of fuzzy solution based on α-cuts and Pareto optimal solutions of a biobjective optimization problem. As far as solving methods are concerned, the linear fractional programming, as an extension of linear programming, is easy enough to be handled by means of linear programming but complicated enough to elude a simple analogy. We follow the construction of the fuzzy solution for the linear case introduced by Dempe and Ruziyeva (2012), avoid the inconvenience of the classic weighted sum method for determining Pareto optimal solutions and generate the set of solutions for a linear fractional program with fuzzy coefficients in the objective function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Suggested Approach for Stochastic Interval-Valued Linear Fractional Programming problem

In this paper, we considered a Stochastic Interval-Valued Linear Fractional Programming problem(SIVLFP). In this problem, the coefficients and scalars in the objective function are fractional-interval, and technological coefficients and the quantities on the right side of the constraints were random variables with the specific distribution. Here we changed a Stochastic Interval-Valued Fractiona...

متن کامل

Interactive multiple objective programming in optimization of the fully fuzzy quadratic programming problems

In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered.  To optimize th...

متن کامل

A Parametric Approach for Solving Multi-Objective Linear Fractional Programming Phase

In this paper a multi - objective linear fractional programming problem with the fuzzy variables and vector of fuzzy resources is studied and an algorithm based on a parametric approach is proposed. The proposed solving procedure is based on the parametric approach to find the solution, which provides the decision maker with more complete information in line with reality. The simplicity of the ...

متن کامل

Penalty Method Algorithm for Fuzzy Linear Fractional Optimization

In the classical problems of mathematical programming the coefficients are assumed to be exactly known. This assumption is seldom satisfied by great majority of real-life problems. Starting from the idea of K.D. Jamison and W.A. Lodwick which solve a fuzzy linear programming problem (2001), a linear fractional programming problem with fuzzy coefficients is described and a solving algorithm is o...

متن کامل

An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012